GADIA: A Greedy Asynchronous Distributed Interference Avoidance Algorithm
نویسندگان
چکیده
منابع مشابه
Distributed incremental interference avoidance
We investigate practical methods of distributed interference avoidance where users iteratively adapt their codewords in response to global feedback from the receiver. In turn, the receiver adaptively tracks user codewords and offers a reasonable alternative to feeding back codewords. We introduce variants of standard interference avoidance procedures which produce more easily tracked incrementa...
متن کاملDALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs
Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...
متن کاملdald:-distributed-asynchronous-local-decontamination algorithm in arbitrary graphs
network environments always can be invaded by intruder agents. in networks where nodes are performing some computations, intruder agents might contaminate some nodes. therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. in this paper, we present a distributed asynchronous local algorithm for decontaminating a network. in mos...
متن کاملN-GAIR: Non-Greedy Asynchronous Interference Reduction Algorithm in Wireless Networks
In this paper, we consider optimum channel/frequency allocation problem in wireless networks by reducing total network interference signal powers, which is an NP-complete problem. Its optimum solution for general wireless networks for even 2-channel case is not known. Turning the channel/frequency allocation problem into a maxCut graph partitioning problem, we i) propose a spectral clustering b...
متن کاملGreedy Interference Avoidance in Non-Collaborative Multi-Base Wireless Systems
In this paper we present application of greedy interference avoidance to wireless systems with multiple bases which do not collaborate or exchange information. We start with a simple system consisting of two users and two base stations for which we formally state a greedy interference avoidance algorithm and show that its application converges to a simultaneous water filling solution which is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2010
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2010.2081090